Active Sampling for Open-Set Classification without Initial Annotation
نویسندگان
چکیده
منابع مشابه
Partition Sampling for Active Video Database Annotation
Annotating a video-database requires an intensive human effort that is time consuming and error prone. However this task is mandatory to bridge the gap between low-level video features and the semantic content. We propose a partition sampling active learning method to minimize human effort in labeling. Formally, active learning is a process where new unlabeled samples are iteratively selected a...
متن کاملOpen-Set Classification for Automated Genre Identification
Automated Genre Identification (AGI) of web pages is a problem of increasing importance since web genre (e.g. blog, news, eshops, etc.) information can enhance modern Information Retrieval (IR) systems. The state-of-the-art in this field considers AGI as a closed-set classification problem where a variety of web page representation and machine learning models have intensively studied. In this p...
متن کاملActive Set Identification without Derivatives
We consider active set identification for linearly constrained optimization problems in the absence of explicit information about the derivative of the objective function. We focus on generating set search methods, a class of derivative-free direct search methods. We begin by presenting some general results on active set identification that are not tied to any particular algorithm. These genera...
متن کاملDropout Sampling for Robust Object Detection in Open-Set Conditions
Dropout Variational Inference, or Dropout Sampling, has been recently proposed as an approximation technique for Bayesian Deep Learning and evaluated for image classification and regression tasks. This paper investigates the utility of Dropout Sampling for object detection for the first time. We demonstrate how label uncertainty can be extracted from a state-of-the-art object detection system v...
متن کاملActive Set Identification for Linearly Constrained Minimization Without Explicit Derivatives
We consider active set identification for linearly constrained optimization problems in the absence of explicit information about the derivative of the objective function. We begin by presenting some general results on active set identification that are not tied to any particular algorithm. These general results are sufficiently strong that, given a sequence of iterates converging to a Karush–K...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33014416